Prison renaming : solving intractable internal problems by external renaming?

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Group Renaming

We study the group renaming problem, which is a natural generalization of the renaming problem. An instance of this problem consists of n processors, partitioned into m groups, each of at most g processors. Each processor knows the name of its group, which is in {1, . . . , M}. The task of each processor is to choose a new name for its group such that processors from different groups choose dif...

متن کامل

Fast, Long-Lived Renaming

We consider wait-free solutions to the renaming problem for shared-memory multiprocessing systems [3, 5]. In the renaming problem, processes are required to choose new names in order to reduce the size of their name space. Previous solutions to the renaming problem have time complexity that is dependent on the size of the original name space, and allow processes to acquire names only once. In t...

متن کامل

Optimal Parallel Randomized Renaming

We consider the Renaming Problem, a basic processing step in string algorithms, for which we give a simultaneously work and time optimal Las Vegas type PRAM algorithm. The Renaming Problem is closely related to the Multiset Sorting Problem.

متن کامل

Space Bounds for Adaptive Renaming

We study the space complexity of implementing long-lived and one-shot adaptive renaming from multi-reader multi-writer registers, in an asynchronous distributed system with n processes. As a result of an f -adaptive renaming algorithm each participating process gets a distinct name in the range {1, . . . , f (k)} provided k processes participate. Let f : {1, . . . ,n}→N be a non-decreasing func...

متن کامل

Fast Long Lived Renaming

The long-lived renaming problem appears in shared-memory systems where a set of threads need to register and deregister frequently from the computation, while concurrent operations scan the set of currently registered threads. Instances of this problem show up in concurrent implementations of transactional memory, flat combining, thread barriers, and memory reclamation schemes for lock-free dat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nomina Africana: Journal of African Onomastics

سال: 2019

ISSN: 1012-0254,2706-9842

DOI: 10.2989/na.2019.33.1.6.1336